A constructive heuristic for the uniform capacitated vertex <i>k</i> -center problem

The uniform capacitated vertex k -center problem is an \(\mathcal {NP} \) -hard combinatorial optimization that models real situations where centers can only attend a maximum number of customers, and the travel time or distance from customers to their assigned center has be minimized. This paper introduces polynomial-time constructive heuristic algorithm exploits relationship between this minimum dominating set problem. proposed based on one-hop farthest-first proven effective for uncapacitated version We carried out different empirical evaluations heuristics, including analysis effect parallel implementation algorithm, which significantly improved running relatively large instances.